Shortest prefix strings containing all subset permutations
نویسندگان
چکیده
منابع مشابه
Short strings containing all k-element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملShorter strings containing all k - element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملWords containing all permutations of a family of factors
In this note, we prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than linearly. This result generalizes one of the lemmas of a recent paper by de Luca and Zamboni, where it was proved that such an infinite word cannot ...
متن کاملShortest Unique Queries on Strings
Let D be a long input string of n characters (from an alphabet of size up to 2 , wherew is the number of bits in a machine word). Given a substring q of D, a shortest unique query returns a shortest unique substring of D that contains q. We present an optimal structure that consumes O(n) space, can be built in O(n) time, and answers a query in O(1) time. We also extend our techniques to solve s...
متن کاملPrefix transpositions on binary and ternary strings
The problem of Sorting by Prefix Transpositions asks for the minimum number of prefix transpositions required to sort the elements of a given permutation. In this paper, we study a variant of this problem where the prefix transpositions act not on permutations but on strings over an alphabet of fixed size. Here, we determine the minimum number of prefix transpositions required to sort the binar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90193-2